Normalisation in Weakly Orthogonal Rewriting
نویسنده
چکیده
A rewrite sequence is said to be outermost-fair if every outer-most redex occurrence is eventually eliminated. Outermost-fair rewriting is known to be (head-)normalising for almost orthogonal rewrite systems. In this paper we study (head-)normalisation for the larger class of weakly orthogonal rewrite systems. Normalisation is established and a counterexample against head-normalisation is provided. Nevertheless, innnitary normalisation, which is usually obtained as a corollary of head-normalisation, is shown to hold.
منابع مشابه
Vicious Circles in Rewriting Systems
We continue our study of the difference between Weak Normalisation (WN) and Strong Normalisation (SN). We extend our earlier result that orthogonal TRSs with the property WN do not admit cyclic reductions, into three distinct directions: (i) to the higher-order case, where terms may contain bound variables, (ii) to the weakly orthogonal case, where rules may have (trivial) conflicts, and (iii) ...
متن کاملOn Normalisation of Infinitary Combinatory Reduction Systems
For fully-extended, orthogonal infinitary Combinatory Reduction Systems, we prove that terms with perpetual reductions starting from them do not have (head) normal forms. Using this, we show that 1. needed reduction strategies are normalising for fully-extended, orthogonal infinitary Combinatory Reduction Systems, and that 2. weak and strong normalisation coincide for such systems as a whole an...
متن کاملStrong Normalisation Proofs for Cut Elimination in Gentzen's Sequent Calculi
We deene a variant LKsp of the Gentzen sequent calculus LK. In LKsp weakenings or contractions can be done in parallel. This modiication allows us to interpret a symmetrical system of mix elimination rules ELKsp by a nite rewriting system; the termination of this rewriting system can be checked by machines. We give also a self-contained strong normalisation proof by structural induction. We giv...
متن کاملUnique Normal Forms in Infinitary Weakly Orthogonal Term Rewriting
We present some contributions to the theory of infinitary rewriting for weakly orthogonal term rewrite systems, in which critical pairs may occur provided they are trivial. We show that the infinitary unique normal form property (UN∞) fails by a simple example of a weakly orthogonal TRS with two collapsing rules. By translating this example, we show that UN∞ also fails for the infinitary λβη-ca...
متن کاملOn weakly orthogonal constructor-based graph rewriting
We investigate the rewrite relation over graphs induced by constructor-based weakly orthogonal graph rewriting systems. It is well known that this relation is not connuent in general whereas it is connuent in the case of weakly orthogonal term rewriting systems. We show, however , that the considered relation is always connuent, as well as connuent modulo bisimilarity, for a large class of grap...
متن کامل